Approximate Gaussian Elimination
نویسندگان
چکیده
Approximate Gaussian Elimination
منابع مشابه
Complete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملA Multigrid Method Based on Incomplete Gaussian Elimination
In this paper we introduce and analyze a new Schur complement approximation based on incomplete Gaussian elimination. The approximate Schur complement is used to develop a multigrid method. This multigrid method has an algorithmic structure that is very similar to the algorithmic structure of classical multigrid methods. The resulting method is almost purely algebraic and has interesting robust...
متن کامل0 v 1 [ m at h . A G ] 1 4 Fe b 20 07 Approximate radical for clusters : a global ap - proach using Gaussian elimination or SVD
We present a method based on Dickson’s lemma to compute the “approximate radical” of a zero dimensional ideal Ĩ in C[x1, . . . , xm] which has zero clusters: the approximate radical ideal has exactly one root in each cluster for sufficiently small clusters. Our method is “global” in the sense that it does not require any local approximation of the zero clusters: it reduces the problem to the co...
متن کاملAn approximate cyclic reduction multilevel preconditioner for general sparse matrices
We discuss an iterative method for solving large sparse systems of equations. A hybrid method is introduced which uses ideas both from ILU preconditioning and from multigrid. The resulting preconditioning technique requires the matrix only. A multilevel structure is obtained by using maximal independent sets for graph coarsening. For Schur complement approximation on coarser graphs an incomplet...
متن کامل. A G ] 1 4 Fe b 20 07 Approximate radical for clusters : a global ap - proach using Gaussian elimination or SVD
We present a method based on Dickson’s lemma to compute the “approximate radical” of a zero dimensional ideal Ĩ in C[x1, . . . , xm] which has zero clusters: the approximate radical ideal has exactly one root in each cluster for sufficiently small clusters. Our method is “global” in the sense that it does not require any local approximation of the zero clusters: it reduces the problem to the co...
متن کامل